Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
401	GraphX: Unifying Data-Parallel and Graph-Parallel Analytics Reynold S. Xin Joseph E. Gonzalez Daniel Crankshaw Add to Reading List Source URL: amplab.cs.berkeley.edu Language: English - Date: 2014-02-12 16:56:08 Neighbourhood Graph coloring Vertex Degree Connected component Configurations Line graph Graph theory Graph operations Graph
402	The relationship between difference and ratio and a proposal: Equivalence of temperature and time, and the first spontaneous symmetry breaking Add to Reading List Source URL: www.jcheminf.com Language: English Graph Vertex Planar graph Matching Graph operations Pseudoforest Graph coloring Graph theory Mathematics Tree
403	SPATIAL STRUCTURES TO SUPPORT AUTOMATIC GENERALISATION Nicolas Regnauld © Crown copyrightReproduced by permission of Ordnance Survey. Research & Innovation, Ordnance Survey®, Great Britain. E-mail: nicolas.regn Add to Reading List Source URL: www.ordnancesurvey.co.uk Language: English - Date: 2014-05-14 06:52:26 Delaunay triangulation Neighbourhood Graph Topology Minimum spanning tree Pitteway triangulation Edge coloring Graph theory Triangulation Mathematics
404	Introduction and Motivation Algorithms Conclusion Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-23 12:21:52
405	First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh Add to Reading List Source URL: www.math.cornell.edu Language: English - Date: 2015-01-22 09:08:15 Forbidden graph characterization Configurations Planar graphs Graph coloring Möbius–Kantor graph Graph theory Robertson–Seymour theorem Bipartite graph
406	Preface Professor Cameron was a plenary speaker at the INTERNATIONAL WORKSHOP ON COMBINATORICS, LINEAR ALGEBRA, AND GRAPH COLORING which was held at IPM in August ofAfter the conference he stayed an extra week at Add to Reading List Source URL: www.ipm.ac.ir Language: English - Date: 2011-09-28 00:50:08 Institute for Studies in Theoretical Physics and Mathematics Iran
407	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
408	Maximum Motif Problem in Vertex-Colored Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-21 01:15:30 Graph coloring NP-complete problems Graph theory Parameterized complexity NP-complete Theoretical computer science Mathematics Applied mathematics
409	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
410	Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,il Add to Reading List Source URL: kowshik.github.io Language: English - Date: 2011-10-18 16:44:37 Graph coloring Vertex Graph Bellman–Ford algorithm Connected component Shortest path problem Tree Clique Matching Graph theory Graph connectivity Path

UPDATE